Strong converse, feedback channel capacity and hypothesis testing
نویسندگان
چکیده
منابع مشابه
Strong Converse, Feedback Channel Capacity and Hypothesis Testing
In light of recent results by Verd u and Han on channel capacity, we examine three problems: the strong converse condition to the channel coding theorem, the capacity of arbitrary channels with feedback and the Neyman-Pearson hypothesis testing type-II error exponent. It is rst remarked that the strong converse condition holds if and only if the sequence of normalized channel information densit...
متن کاملStrong converse and Stein's lemma in quantum hypothesis testing
The hypothesis testing problem of two quantum states is treated. We show a new inequality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the quantum version of Stein’s lemma. The inequality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the quantum relative entrop...
متن کاملStrong Converse and Stein’s Lemma in the Quantum Hypothesis Testing
The hypothesis testing problem of two quantum states is treated. We show a new inequality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the quantum version of Stein’s lemma. The inequality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the quantum relative entrop...
متن کاملStrong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
We study the difficulty of discriminating between an arbitrary quantum channel and a “replacer” channel that discards its input and replaces it with a fixed state.1 The results obtained here generalize those known in the theory of quantum hypothesis testing for binary state discrimination. We show that, in this particular setting, the most general adaptive discrimination strategies provide no a...
متن کاملA strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation
In statistical inference problems, we wish to obtain lower bounds on the minimax risk, that is to bound the performance of any possible estimator. A standard technique to do this involves the use of Fano’s inequality. However, recent work in an information-theoretic setting has shown that an argument based on binary hypothesis testing gives tighter converse results (error lower bounds) than Fan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Chinese Institute of Engineers
سال: 1995
ISSN: 0253-3839,2158-7299
DOI: 10.1080/02533839.1995.9677746